package com.yun.algorithmproblem.leetcodenotcomplete;

public class Leetcode2867 {
    private final static int MX = (int) 1e5;
    private final static boolean[] np = new boolean[MX + 1];

    static {
        np[1] = true;
        for (int i = 2; i * i <= MX; i++) {
            if(!np[i]){
                for (int j = i*i; j <= MX; j+=i) {
                    np[j]=true;
                }
            }
        }
    }

    public long countPaths(int n, int[][] edges) {
        for (int i = 0; i < 10; i++) {
            System.out.println(np[i]);
        }
        return 0;
    }

    public static void main(String[] args) {
        int n = 4;
        int[][] edges = {{1, 2}, {4, 1}, {3, 4}};
        Leetcode2867 test = new Leetcode2867();
        test.countPaths(n, edges);
    }
}
